Genetic Programming Approach for Classification Problem using GPU
نویسندگان
چکیده
منابع مشابه
automatic verification of authentication protocols using genetic programming
implicit and unobserved errors and vulnerabilities issues usually arise in cryptographic protocols and especially in authentication protocols. this may enable an attacker to make serious damages to the desired system, such as having the access to or changing secret documents, interfering in bank transactions, having access to users’ accounts, or may be having the control all over the syste...
15 صفحه اولA genetic algorithm approach for problem
In this paper, a genetic algorithm is presented for an identical parallel-machine scheduling problem with family setup time that minimizes the total weighted flow time ( ). No set-up is necessary between jobs belonging to the same family. A set-up must be scheduled when switching from the processing of family i jobs to those of another family j, i j, the duration of this set-up being the sequ...
متن کاملMedical Problem Classification Using Layered Genetic Programming with Feature Generation
This paper proposes a novel architecture of genetic programming (GP) called layered genetic programming (LAYERGP) to generate new features of a given dataset. LAYERGP is a new architecture of multipopulation GP (MGP) that contains a number of layers each of which comprises a set of independent populations. New features are created by evaluating the best functions generated by a layer for all po...
متن کاملUsing Genetic Programming for Document Classification
Gom,l.ic l~rogrammiug is su(’rcssfully used to evolve agrnt.s (’almblr of classifying textual doc,tntonts arcording to the interests of the us,’r. Thr system uses a I~rt’(’lassilicd set of do(’umonts to Irain the agrnts, and the results arr tht,n tost.od Oil all ;dlernat.ive sot of t|og~lllll(,lltS.
متن کاملSimulated Annealing Approach for Solving Bilevel Programming Problem
Bilevel programming, a tool for modeling decentralized decision problems, consists of the objective of the leader at its first level and that of the follower at the second level. Bilevel programming has been proved to be an Np-hard problem. Numerous algorithms have been developed for solving bilevel programming problems. These algorithms lack the required efficiency for solving a real problem. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceeding of the Electrical Engineering Computer Science and Informatics
سال: 2020
ISSN: 2407-439X,2407-439X
DOI: 10.11591/eecsi.v7.2039